Balanced Circular Packing Problems with Distance Constraints
نویسندگان
چکیده
The packing of different circles in a circular container under balancing and distance conditions is considered. Two problems are studied: the first minimizes container’s radius, while second maximizes minimal between circles, as well boundary container. Mathematical models solution strategies provided illustrated with computational results.
منابع مشابه
Circular Coloring for Graphs with Distance Constraints
Let G = (V,E) be a simple un-weighted graph, and let → d= (d1, d2, · · ·, dm) be a sequence of positive reals. For a positive real r, let Sr denote the circle on R 2 centered at the origin with circumference r. A circular r−coloring for G with distance constraint → d is a mapping f : V (G) → Sr such that |f(u) − f(v)|r ≥ di, whenever the distance between u and v in G is i (where |x− y|r is the ...
متن کاملOn the global minimum in a balanced circular packing problem
The paper considers balanced packing problem of a given family of circles into a larger circle of the minimal radius as a multiextremal nonlinear programming problem. We reduce the problem to unconstrained minimization problem of a nonsmooth function by means of nonsmooth penalty functions. We propose an efficient algorithm to search for local extrema and an algorithm for improvement of the low...
متن کاملLocation-Routing Problems with Distance Constraints
A important aspect of designing a distribution system is determining the locations of the facilities. For systems in which deliveries are made along multiple stop routes, the routing problem and location problem must be considered simultaneously. In this paper, a set-partitioning-based formulation of an uncapacitated location-routing model with distance constraints is presented. An alternate se...
متن کاملArbitrary Overlap Constraints in Graph Packing Problems
In earlier versions of the community discovering problem, the overlap between communities was restricted by a simple count upperbound [17,5,11,8]. In this paper, we introduce the Π-Packing with α()Overlap problem to allow for more complex constraints in the overlap region than those previously studied. Let V be all possible subsets of vertices of V (G) each of size at most r, and α : V × V → {0...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computation (Basel)
سال: 2022
ISSN: ['2079-3197']
DOI: https://doi.org/10.3390/computation10070113